Asynchronous Circuit Veri cation Using Trace Theory and CCS
نویسنده
چکیده
We investigate asynchronous circuit veri cation using Dill s trace theory as well as Milner s CCS as mechanized by the Concur rency Workbench Trace theory is a formalism speci cally designed for asynchronous circuit speci cation and veri cation CCS is a gen eral purpose calculus of communicating systems that is being recently applied for hardware speci cation and veri cation Although both formalisms are similar in many respects we nd that there are many interesting di erences between them when applied to asynchronous cir cuit speci cation and veri cation The purpose of this paper is to point out these di erences many of which are precautions for avoiding writ ing incorrect speci cations A long term objective of this work is to nd a way to take advantage of the strengths of both the Trace The ory veri er and the Concurrency Workbench in verifying asynchronous circuits
منابع مشابه
(V)HDL-based Veri cation of Heterogeneous Synchronous/Asynchronous Systems
The modelling and veri cation of two types of heterogeneous systems is discussed: (i) systems consisting of synchronous subsystems with di erent clocks, and (ii) systems which are composed of synchronous and asynchronous subsystems. Concurrent behaviour is represented in VHDL by means of additional input signals, i.e., \concurrency is additional inputs plus fairness". State space exploration te...
متن کاملVeri cation of Bounded Delay Asynchronous Circuits with Timed Traces
In this paper, we extend the veriication method based on the failure semantics of process algebra and the resulting trace theory by Dill et al. for bounded delay asynchronous circuits. We deene a timed conformance relation between trace structures which allows to express both safety and responsiveness properties. In our approach, bounded delay circuits as well as their real-time properties are ...
متن کاملRelative Liveness From Intuition to Automated Veri cation
We point out de ciencies of previous treatments of liveness We de ne a new liveness condition in two forms one based on nite trace theory and the other on automata We prove the equivalence of these two de nitions We also intro duce a safety condition and provide modular and hierarchical veri cation theorems for both safety and liveness Finally we present a veri cation algorithm for liveness Ind...
متن کاملTrace and Testing Equivalence on Asynchronous Processes
We study trace and may-testing equivalences in the asynchronous versions of CCS and-calculus. We start from the operational deenition of the may-testing preorder and provide for it nitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also touch upon two variants of this theory, by rst considering a more demanding equivalence notion (must-...
متن کاملHardware Modeling and Veri cation of an ATM Ring MAC Protocol
The VLSI design of nite-state concurrent hardware systems is toda ypresent in many elds, in particular in the design of digital and communication systems. Late detection of design errors in the design phase are very costly in any system development. These errors can delay the product deployment and even cause the failure of the product. The traditionally used simulation techniques cannot cover ...
متن کامل